Omnibus Sequences, Coupon Collection, and Missing Word Counts
نویسندگان
چکیده
منابع مشابه
Missing Word Counts
The English translation of Leo Tolstoy’s novel War and Peace has the following notable property: it contains this paragraph as a subsequence. If one were to write the letters and spaces that appear in the book as a string, then there would be a subsequence of the string that is identical to the string of letters and spaces in this paragraph. The full property is more general than that – War and...
متن کاملEn passant Coupon Collection
Spontaneous interaction in public places has evolved as crucial concern in interaction design, particularly in the domain of public advertising. Implicit interaction is a mode of spontaneous interaction in which the user is not attentively or explicitly expressing input to a system, but the system from observing the user, and considering all the available information that describes the user sit...
متن کاملThe Hypergeometric Coupon Collection Problem and its Dual
Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all o...
متن کاملThe Coupon Subset Collection Problem
The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give effic...
متن کاملDeterministic Coupon Collection and Better Strong Dispersers
Hashing is one of the main techniques in data processing and algorithm design for very large data sets. While random hash functions satisfy most desirable properties, it is often too expensive to store a fully random hash function. Motivated by this, much attention has been given to designing small families of hash functions suitable for various applications. In this work, we study the question...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2011
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-011-9247-6